boolean network造句

4 . a famous depth minimization algorithm flowmap is described and implemented . a new technology are applied in computing maximal flow of a boolean network
4.自主实现了flowmap算法,利用布尔网络的特点,采用新的标号法求得网络的最大流。
paths from start point to end point are founded, and the max-flow of boolean network is got by this way, which avoid conversion of graphics, and time complexity is lowered as well
本论文利用标号法寻求起始点到终点的通路的方法,来求得布尔网络的最大流,使得图的变换减少,时间复杂度也随之减少。
firstly, we study some models which are often used in reconstructing gene regulatory networks, weighed matrices model, boolean networks model, mutual-information networks model, linear combination model, directed graphs and undirected graphs, bayesian networks model and analyze the strengths and weakness of each model by discussing each model ’ s details
首先,我们探讨了用于推断基因表达调控网络的一些常用模型,加权矩阵模型、布尔网络模型、互信息关联网络模型、线性组合模型、有向图和无向图以及贝叶斯网络模型。逐个分析了每种方法的优缺点。
It's difficult to find boolean network in a sentence. 用boolean network造句挺难的